منابع مشابه
Fast Eigen Matching Accelerating Matching and Learning of Eigenspace method
We propose Fast Eigen Matching, a method for accelerating the matching and learning processes of the eigenspace method for rotation invariant template matching (RITM). Correlation-based template matching is one of the basic techniques used in computer vision. Among them, rotation invariant template matching (RITM), which locates a known template in a query irrespective of the template’s transla...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملHierarchical Eigen Template Matching for Target Detection
The template matching is the basic technique of the object detection such as the defect inspection and OCR (Optical Character Recognition). It has a problem which requires a lot of computational time for detecting the XY displacement and the rotational angle of the target object. We have proposed the eigen template method for this problem. The proposed method can efficiently calculate correlati...
متن کاملFast unsupervised speak through a discriminative Eigen
We present a new method for unsupervised, fast speaker adaptation that combines the Eigen-MLLR transform approach with discriminative MLLR. We thereby aim to profit both from the performance improvements that are generally provided by a discriminative approach, and from the reliability that Eigen-MLLR has demonstrated in fast adaptation scenarios. We present first evaluation results on the Spok...
متن کاملA Fast Algorithm for Matrix Eigen-decompositionn
We propose a fast stochastic Riemannian gradient eigensolver for a real and symmetric matrix, and prove its local, eigengap-dependent and linear convergence. The fast convergence is brought by deploying the variance reduction technique which was originally developed for the Euclidean strongly convex problems. In this paper, this technique is generalized to Riemannian manifolds for solving the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Precision Engineering
سال: 2016
ISSN: 0912-0289,1882-675X
DOI: 10.2493/jjspe.82.1054